Evolving Effective Incremental Solvers for Sat with a Hyper-heuristic Framework Based on Genetic Programming
نویسندگان
چکیده
Hyper-heuristics could simply be defined as heuristics to choose other heuristics. In other words, they are methods for combining existing heuristics to generate new ones. In this paper, we use a grammar-based genetic programming hyperheuristic framework. The framework is used for evolving effective incremental solvers for SAT. The evolved heuristics perform very well against well-known local search heuristics on a variety of benchmark SAT problems.
منابع مشابه
Evolving timetabling heuristics using a grammar-based genetic programming hyper-heuristic framework
This paper introduces a Grammar-based Genetic Programming Hyper-Heuristic framework (GPHH) for evolving constructive heuristics for timetabling. In this application GP is used as an online learning method which evolves heuristics while solving the problem. In other words, the system keeps on evolving heuristics for a problem instance until a good solution is found. The framework is tested on so...
متن کاملGenerating SAT Local-Search Heuristics Using a GP Hyper-Heuristic Framework
We present GP-HH, a framework for evolving local-search 3-SAT heuristics based on GP. The aim is to obtain “disposable” heuristics which are evolved and used for a specific subset of instances of a problem. We test the heuristics evolved by GP-HH against well-known local-search heuristics on a variety of benchmark SAT problems. Results are very encouraging.
متن کاملA Hyper-Heuristic Approach to Evolving Algorithms for Bandwidth Reduction Based on Genetic Programming
The bandwidth reduction problem is a well-known NP-complete graphlayout problem that consists of labeling the vertices of a graph with integer labels in such a way as to minimize the maximum absolute difference between the labels of adjacent vertices. The problem is isomorphic to the important problem of reordering the rows and columns of a symmetric matrix so that its non-zero entries are maxi...
متن کاملCost-Effective Hyper-Resolution for Preprocessing CNF Formulas
We present an improvement to the Hypre preprocessing algorithm that was suggested by Bacchus and Winter in SAT 2003 [2]. Given the power of modern SAT solvers, Hypre is currently one of the only cost-effective preprocessors, at least when combined with some modern SAT solvers and on certain classes of problems. Our algorithm, although it produces less information than Hypre, is much more effici...
متن کاملDissolve: A Distributed SAT Solver based on St̊almarck’s Method
Creating an effective parallel SAT solver is known to be a challenging task. At present, the most efficient implementations of parallel SAT solvers are portfolio solvers with some heuristics to share learnt clauses. In this paper, we propose a novel approach for solving SAT problems in parallel based on the combination of traditional CDCL with St̊almarck’s method. In particular, we use a variant...
متن کامل